Design Of A Min-Sum Arborescence With Outage Costs
نویسنده
چکیده
We present an integer programming formulation of the min-sum arborescence with node outage costs problem. The solution to the problem consists of selecting links to connect a set of terminal nodes to a root node with minimal expected annual cost, where the annual cost is the sum of annual links costs and annual outage costs. The links in the network are prone to failure and each terminal node has an associated outage cost, which is the economic cost incurred by the network user whenever that node is disabled from the central node due to failure of a link. We suggest a Lagrangian-based heuristic to get a good solution to this problem. This solution procedure also gives lower bounds to the optimal solution and is used to assess the quality of the heuristic solution. Numerical experiments taken from instances with up to 100 nodes are used to evaluate the performance of the proposed heuristic.
منابع مشابه
A Hop Constrained Min-Sum Arborescence with Outage Costs
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,......n} to a central node with minimal total link cost such that (a) each terminal node j has exactly one entering link; (b) for each terminal node j, a unique path from the central node to j exists; (c) for each terminal node j the number ...
متن کاملMulticell Coordinated Beamforming with Rate Outage Constraint-Part I: Complexity Analysis
This paper studies the coordinated beamforming (CoBF) design in the multiple-input single-output interference channel, assuming only channel distribution information given a priori at the transmitters. The CoBF design is formulated as an optimization problem that maximizes a predefined system utility, e.g., the weighted sum rate or the weighted max-min-fairness (MMF) rate, subject to constraint...
متن کاملLower Bounds for the Multiperiod Capacitated Minimal Spanning Tree with Node Outage Cost Design Problem
The Multiperiod Capacitated Minimal Spanning Tree With Node Outage Costs (MCMSTWOC) Design problem consists of scheduling the installation of links in a communication network so as to connect a set of terminal nodes S = [2,3...N] to a central node (node 1) with minimal present value of costs. The cost of the network is the sum of link layout cost and node outage costs. The link capacities limit...
متن کاملA Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem
In this paper an inverse problem of the weighted shortest arborescence problem is discussed. That is. given a directed graph G and a set of nonnegative costs on its arcs. we need to modify those costs as little as possible to ensure that T, a given (.I-arborescence of G, is the shortest one. It is found that only the cost of T needs modifying. An O(rz”) combinatorial algorithm is then proposed....
متن کاملBlocking Optimal Arborescences
The problem of covering minimum cost common bases of two matroids is NP-complete, even if the two matroids coincide, and the costs are all equal to 1. In this paper we show that the following special case is solvable in polynomial time: given a digraph D = (V,A) with a designated root node r ∈ V and arc-costs c : A → R, find a minimum cardinality subset H of the arc set A such that H intersects...
متن کامل